Interactions of zeros of polynomials and multiplicity matrices
نویسندگان
چکیده
An m×(n+1) multiplicity matrix is a M=(μi,j) with rows enumerated by i∈{1,2,…,m} and columns j∈{0,1,…,n} whose coordinates are nonnegative integers satisfying the following two properties: (1) If μi,j≥1, then j≤n−1 μi,j+1=μi,j−1, (2) colsumj(M)=∑i=1mμi,j≤n−j for all j. Let K be field of characteristic 0 let f(x) polynomial degree n coefficients in K. f(j)(x) jth derivative f(x). Λ=(λ1,…,λm) sequence distinct elements For j∈{1,2,…,n}, μi,j λi as zero f(j)(x). The Mf(Λ)=(μi,j) called respect to Λ. Conditions established, examples constructed matrices that not polynomials. open problem classify polynomials K[x] construct
منابع مشابه
Multiplicity of Zeros and Discrete Orthogonal Polynomials
We consider a problem of bounding the maximal possible multiplicity of a zero of some expansions ∑ aiFi(x), at a certain point c, depending on the chosen family {Fi}. The most important example is a polynomial with c = 1. It is shown that this question naturally leads to discrete orthogonal polynomials. Using this connection we derive some new bounds, in particular on the multiplicity of the ze...
متن کاملBlock Jacobi Matrices and Zeros of Multivariate Orthogonal Polynomials
A commuting family of symmetric matrices are called the block Jacobi matrices, if they are block tridiagonal. They are related to multivariate orthogonal polynomials. We study their eigenvalues and joint eigenvectors. The joint eigenvalues of the truncated block Jacobi matrices correspond to the common zeros of the multivariate orthogonal polynomials.
متن کاملInterpolating functions of matrices on zeros of quasi-kernel polynomials
The computation of functions of matrices is a classical topic in numerical linear algebra. In the recent years research in this area has received new impulse due to the introduction of Krylov subspace techniques for the treatment of functions of large and sparse matrices, in particular in the context of the solution of di erential problems. Such techniques are projective in nature, since they r...
متن کاملDeterminants and permanents of Hessenberg matrices and generalized Lucas polynomials
In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...
متن کاملSome compact generalization of inequalities for polynomials with prescribed zeros
Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$. In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$, $k^2 leq rRleq R^2$ and for $Rleq r leq k$. Our results refine and generalize certain well-known polynomial inequalities.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2023
ISSN: ['1090-266X', '0021-8693']
DOI: https://doi.org/10.1016/j.jalgebra.2022.09.016